Multi-human Parsing with a Graph-based Generative Adversarial Model

نویسندگان

چکیده

Human parsing is an important task in human-centric image understanding computer vision and multimedia systems. However, most existing works on human mainly tackle the single-person scenario, which deviates from real-world applications where multiple persons are present simultaneously with interaction occlusion. To address such a challenging multi-human problem, we introduce novel model named MH-Parser, uses graph-based generative adversarial to challenges of close-person occlusion parsing. validate effectiveness new model, collect dataset Multi-Human Parsing (MHP), contains intensive person entanglement. Experiments MHP datasets demonstrate that proposed method effective addressing problem compared solutions literature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generative Multi-Adversarial Networks

Generative adversarial networks (GANs) are a framework for producing a generative model by way of a two-player minimax game. In this paper, we propose the Generative Multi-Adversarial Network (GMAN), a framework that extends GANs to multiple discriminators. In previous work, the successful training of GANs requires modifying the minimax objective to accelerate training early on. In contrast, GM...

متن کامل

Multi-Generator Generative Adversarial Nets

We propose in this paper a new approach to train the Generative Adversarial Nets (GANs) with a mixture of generators to overcome the mode collapsing problem. The main intuition is to employ multiple generators, instead of using a single one as in the original GAN. The idea is simple, yet proven to be extremely effective at covering diverse data modes, easily overcoming the mode collapsing probl...

متن کامل

Multi-view Generative Adversarial Networks

Learning over multi-view data is a challenging problem with strong practical applications. Most related studies focus on the classification point of view and assume that all the views are available at any time. We consider an extension of this framework in two directions. First, based on the BiGAN model, the Multi-view BiGAN (MV-BiGAN) is able to perform density estimation from multi-view input...

متن کامل

GraphGAN: Graph Representation Learning with Generative Adversarial Nets

The goal of graph representation learning is to embed each vertex in a graph into a low-dimensional vector space. Existing graph representation learning methods can be classified into two categories: generative models that learn the underlying connectivity distribution in the graph, and discriminative models that predict the probability of edge existence between a pair of vertices. In this pape...

متن کامل

Generative Steganography with Kerckhoffs' Principle based on Generative Adversarial Networks

The distortion in steganography comes from the modification or recoding on the cover image during the embedding process. The changes of the cover always leave the steganalyzer with possibility of discriminating. Therefore, we propose to use a cover to send out secret messages without any modification by training the cover image to generate the secret messages. To ensure the security of such a g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Multimedia Computing, Communications, and Applications

سال: 2021

ISSN: ['1551-6857', '1551-6865']

DOI: https://doi.org/10.1145/3418217